منابع مشابه
On the traveling salesman problem in binary Hamming spaces
Given a subsetX of vertices in the n-cube, i.e. the n-dimensional Hamming space, we are interested in the solution for the traveling salesman problem, namely the minimal length of a cycle passing through all vertices of X . For a given number M , we estimate the maximum of these lengths when X ranges over all possible choices of sets ofM vertices. Asymptotically, our estimates mean that for a n...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA Coloring Problem
Introduction. A well-known algorithm for coloring the vertices of a graph is the “greedy algorithm”: given a totally ordered set of colors, each vertex of the graph (taken in some order) is colored with the least color not already used to color an adjacent vertex. When applied to a path graph with at least two vertices, the algorithm uses either 2 or 3 colors, depending on the order in which th...
متن کاملThe Edge-Diametric Theorem in Hamming Spaces
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A 92(1) (2000) 1–16]. © 2007 Elsevier B.V. All rights reserved.
متن کاملColoring Geometric Range Spaces
We study several coloring problems for geometric range-spaces. In addition to their theoretical interest, some of these problems arise in sensor networks. Given a set of points in R or R, we want to color them such that every region of a certain family (e.g., every disk containing at least a certain number of points) contains points of many (say, k) different colors. In this paper, we think of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1997
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0093